Am-permutation polynomials

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutation Polynomials modulo m

This paper mainly studies problems about so called “permutation polynomials modulo m”, polynomials with integer coefficients that can induce bijections over Zm = {0, · · · , m−1}. The necessary and sufficient conditions of permutation polynomials are given, and the number of all permutation polynomials of given degree and the number induced bijections are estimated. A method is proposed to dete...

متن کامل

On inverse permutation polynomials

We give an explicit formula of the inverse polynomial of a permutation polynomial of the form xrf(xs) over a finite field Fq where s | q − 1. This generalizes results in [6] where s = 1 or f = g q−1 s were considered respectively. We also apply our result to several interesting classes of permutation polynomials.

متن کامل

Permutation Polynomials Modulo w

We give an exact characterization of permutation polynomials mod ulo n w w a polynomial P x a a x adx d with integral coe cients is a permutation polynomial modulo n if and only if a is odd a a a is even and a a a is even We also characterize polynomials de ning latin squares mod ulo n w but prove that polynomial multipermutations that is a pair of polynomials de ning a pair of orthogonal latin...

متن کامل

Enumerating permutation polynomials

We consider the problem of enumerating polynomials over Fq, that have certain coefficients prescribed to given values and permute certain substructures of Fq. In particular, we are interested in the group of N -th roots of unity and in the submodules of Fq. We employ the techniques of Konyagin and Pappalardi to obtain results that are similar to their results in [Finite Fields and their Applica...

متن کامل

Permutation Groups and Polynomials

Given a set S with n elements, consider all the possible one-to-one and onto functions from S to itself. This collection of functions is called the permutation group of S, because the functions are simply permuting the elements of S. We notice immediately that it doesn’t matter what the elements of S are (numbers, planets, tacos, etc) just that there are n distinct ones in the set, so we may re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 2006

ISSN: 1446-7887,1446-8107

DOI: 10.1017/s1446788700013033